Load Balancing over Geographic Adaptive Fidelity Routing Protocol for Wireless Sensor Networks

The energy consumption is a great challenge in Wireless sensor networks that may affect the performance of the entire network. Even though many techniques are being still addressed to this issue, it is ongoing problem. One of the most energy efficient routing protocols is Geographic Adaptive Fidelity (GAF), which is the location based protocol. This reduces the use of energy by switching off some nodes that do not take part in routing. Load balancing reduces hot spots in sensor networks by spreading the workload across a sensor network there by increasing the life time of the sensor network. Here we use chebyshev sum metric for evaluation via simulation and this method is better compared to the routing based on Breadth first search(BFS) and shortest path obtained by Dijkstra’s algorithm. By combining Geographic Adaptive Fidelity with load balancing, a considerable amount of energy can be saved that tends to extend the lifespan of the whole network.